提高步进电机步距精度的研究

就步进电机细分可以提高步距精度的问题从理论上进行了分析和研究,并用传递函数的方法研究系统的动态响应,最后给出了不同细分数的步距角的均匀性的实验数据。     

保凸均匀三次B样条插值曲线

均匀三次Ｂ样条曲线虽然具有保凸性,但曲线不通过任何控制顶点,我们在相邻两个控制点之间插入两个新的控制顶点后,所产生的新的均匀三次Ｂ样条曲线不但插值原来所有控制顶点,而且还保凸。本文描述的曲线可以作局部修改,给出了两个数值例子。     

赋双权二部图中最大权最小权完美匹配

本文涉及的是在赋双权的二部图中求关于第一个权最大的限制下、第二个权最小的完美匹配的网络模型,给出了这一模型的有效算法,并用此算法解决了企业的优化组合分工中的挖潜问题。     

利用二坐标R站实现运动辐射源的三维跟踪

本文提出了一种基于目标斜距两次测量值之差和方位角信息的定位跟踪算法,详细分析了该技术的定位原理和可行性。在辐射源匀速直线运动的条件下,如果能够不测俯仰角而只用方位角和距离差实现对目标的定位与跟踪,将不仅可以简化接收站的设备,而且还能够增强其独立性能,因此本文讨论的算法对于单站被动定位跟踪系统的实用性具有重要意义。本文通过典型目标航迹的计算机仿真,对算法的性能做了评估．     

PTL 证明器的实现技术

基于文［１０］中的理论,我们用Ｔｕｒｂｏ─ｐｒｏｌｏｇ编程,在３８６微机上成功地实现了命题时态逻辑定理的证明器。该证明器在处理ｎｅｘｔ幂次、归纳、归结、◇（ｘ∧ｙ）、ｕｎｔｉｌ　等方面,均有独到之处。这些方面,克服了以往工作的不足。证明器界面友好、速度快、能力强。     

用配点法求解四边搁支板的弯曲问题

根据弹性薄板微分方程的一般解和边界条件的配点法来求四边搁支板的弯曲问题,并以对称荷载作用下的正方形板为例进行了分析计算。     

卫星及其诱饵的表面瞬态温度场

文中给出了计算空间目标和诱饵表面温度场的方法,比较了目标和诱饵表面温度特性的差异,指出了这些差异对点目标自动识别的重要意义。     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

The effect of deployment on first‐ and second‐term re‐enlistment in the US active duty force

Why should deployment affect re‐enlistment? In our model, members enter the military with naïve beliefs about deployment and use actual deployment experience to update their beliefs and revise their expected utility of re‐enlisting. Empirically, re‐enlistment is related to the type and number of deployments, consistent with the learning model. Non‐hostile deployment increases first‐term re‐enlistment but hostile deployment has little effect except for the Army, where the effect is positive. Both types increase second‐term re‐enlistment. Interestingly, first‐term members with dependants tend to respond to deployment like second‐term members. In addition, deployment acts directly to affect re‐enlistment, not indirectly through time to promotion.     

Aid versus sanctions for taming oppressors: theory and case study of the Iraqi Kurds

We model an oppressor aiming at victimizing an excluded group in his country, with two main variants. A foreign power affects his behaviour using either conditional aid, subject to the dictator’s participation constraint, or the threat of sanctions, broadly defined, subject to the credibility constraint. The choice between the two is either determined by the latter, or by their relative cost. Aid is preferred when the threat of sanctions is ineffective, and sanctions are too expensive. Sanctions might be imposed, if the threat is ineffective. A case study of the Iraqi Kurds after Iraq was subject to sanctions is presented.